Continually Answering Constraint k-NN Queries in Unstructured P2P Systems
نویسندگان
چکیده
منابع مشابه
Answering Constrained k-NN Queries in Unstructured P2P Systems
The processing of k-NN queries has been studied extensively both in a centralized computing environment and in a structured P2P environment. However, the problem over an unstructured P2P system is not well studied despite of their popularity. Communication-efficient processing of k-NN queries in such an environment is a unique challenge due to the distribution, dynamics and large scale of the s...
متن کاملReducing User Waiting Time for Top-k Queries in Unstructured P2P Systems
Dans les systèmes pair-à-pair (P2P) non-structurés, les requêtes de type top-k sont une solution intéressante, car elles évitent de submerger l’utilisateur avec un grand nombre de réponses. Cependant, les techniques existantes présentent l’inconvénient d’un temps d’attente important pour l’utilisateur. En effet, pour que le résultat de la requête topk soit retourné à l’utilisateur, les réponses...
متن کاملAnswering Structured Queries on Unstructured Data
There is growing number of applications that require access to both structured and unstructured data. Such collections of data have been referred to as dataspaces, and Dataspace Support Platforms (DSSPs) were proposed to offer several services over dataspaces, including search and query, source discovery and categorization, indexing and some forms of recovery. One of the key services of a DSSP ...
متن کاملk-NN Multimedia Retrieval in Unstructured Peer-to-Peer Networks
AbstractRecent years saw the rapid development of peer-to-peer (P2P) networks in a great variety of applications. However, similarity-based k-nearest-neighbor retrieval (k-NN) is still a challenging task in P2P networks due to the multiple constraints such as the dynamic topology and the unpredictable data updates. Caching is an attractive solution that reduces network traffic and hence could r...
متن کاملSummary management in unstructured P2P systems
In this paper, we propose managing data summaries in unstructured P2P systems. Our summaries are intelligible views with two main virtues. First, they can be directly queried and used to approximately answer a query. Second, as semantic indexes, they support locating relevant nodes based on data content. The performance evaluation of our proposal shows that the cost of query routing is minimize...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Computer Science and Technology
سال: 2008
ISSN: 1000-9000,1860-4749
DOI: 10.1007/s11390-008-9151-x